Optimised Search Heuristic Combining Valid Inequalities and Tabu Search
نویسندگان
چکیده
This paper presents an Optimised Search Heuristic that combines a tabu search method with the verification of violated valid inequalities. The solution delivered by the tabu search is partially destroyed by a randomised greedy procedure, and then the valid inequalities are used to guide the reconstruction of a complete solution. An application of the new method to the Job-Shop Scheduling problem is presented.
منابع مشابه
Capacitated Single Allocation P-Hub Covering Problem in Multi-modal Network Using Tabu Search
The goals of hub location problems are finding the location of hub facilities and determining the allocation of non-hub nodes to these located hubs. In this work, we discuss the multi-modal single allocation capacitated p-hub covering problem over fully interconnected hub networks. Therefore, we provide a formulation to this end. The purpose of our model is to find the location of hubs and the ...
متن کاملCombining Global Tabu Search with Local Search for Solving Systems of Equalities and Inequalities
This papers aims at providing a combined strategy for solving systems of equalities and inequalities. The combined strategy uses two types of steps: a global search step and a local search step. The global step relies on a tabu search heuristic and the local step uses a deterministic search known as Hooke and Jeeves. The choice of step, at each iteration, is based on the level of reduction of t...
متن کاملA heuristic approach for multi-stage sequence-dependent group scheduling problems
We present several heuristic algorithms based on tabu search for solving the multi-stage sequence-dependent group scheduling (SDGS) problem by considering minimization of makespan as the criterion. As the problem is recognized to be strongly NP-hard, several meta (tabu) search-based solution algorithms are developed to efficiently solve industry-size problem instances. Also, two different initi...
متن کاملMathematical Programming Manuscript No. Exact and Heuristic Algorithms for the Design of Survivable Networks with Bounded Rings
We study the problem of designing at minimum cost a two-connected network such that each edge belongs to a cycle whose length does not exceed a given bound. This problem was rst studied by Fortz, Labb e and Maaoli 7]. Several classes of valid inequalities for this problem were proposed 5{7]. We study here the separation problems associated to these inequalities and their integration in a Branch...
متن کاملSolving Systems of Inequalities and Equalities by a Nonmonotone Hybrid Tabu Search Method
This paper presents a derivative-free nonmonotone hybrid tabu search to compute a solution of overdetermined systems of inequalities and equalities through the global optimization of an appropriate merit function. The proposed algorithm combines global and local searches aiming to reduce computational effort. Preliminary numerical results show the effectiveness of the combined heuristic.
متن کامل